Consistent transformations of belief functions
نویسنده
چکیده
Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence, but most of all they are the counterparts of consistent knowledge bases in belief calculus. The use of consistent transformations cs[·] in a reasoning process to guarantee coherence can therefore be desirable, and generalizes similar techniques in classical logics. Transformations can be obtained by minimizing an appropriate distance measure between the original belief function and the collection of consistent ones. We focus here on the case in which distances are measured using classical Lp norms, in both the “mass space” and the “belief space” representation of belief functions. While mass consistent approximations reassign the mass not focussed on a chosen element of the frame either to the whole frame or to all supersets of the element on an equal basis, approximations in the belief space do distinguish these focal elements according to the “focussed consistent transformation” principle. The different approximations are interpreted and compared, with the help of examples.
منابع مشابه
Consistent approximations of belief functions
Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence. As most operators used to update or elicit evidence do not preserve consistency, the use of consistent transformations cs[·] in a reasoning process to guarantee coherence can be desirable. Such transformations are turn linked to the problem of approximating an arbitrary belief function with a ...
متن کاملOn Consistent Approximations of Belief Functions in the Mass Space
In this paper we study the class of consistent belief functions, as counterparts of consistent knowledge bases in classical logic. We prove that such class can be defined univocally no matter our definition of proposition implied by a belief function. As consistency can be desirable in decision making, the problem of mapping an arbitrary belief function to a consistent one arises, and can be po...
متن کاملLp consistent approximations of belief functions
Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence. As most operators used to update or elicit evidence do not preserve consistency, the use of consistent transformations cs[·] in a reasoning process to guarantee coherence can be desirable. These are in turn linked to the problem of approximating an arbitrary belief function with a consistent o...
متن کاملPlato's Cave in the Dempster-Shafer land-the Link between Pignistic and Plausibility Transformations
In reasoning under uncertainty in AI, there are (at least) two useful and different ways of understanding beliefs: the first is as absolute belief or degree of belief in propositions and the second is as belief update or measure of change in belief. Pignistic and plausibility transformations are two wellknown probability transformations that map belief functions to probability functions in the ...
متن کاملContinuity of super- and sub-additive transformations of continuous functions
We prove a continuity inheritance property for super- and sub-additive transformations of non-negative continuous multivariate functions defined on the domain of all non-negative points and vanishing at the origin. As a corollary of this result we obtain that super- and sub-additive transformations of continuous aggregation functions are again continuous aggregation functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1407.8151 شماره
صفحات -
تاریخ انتشار 2011